n, k = map(int, input().split())
a, b, c, t = 'LEFT\n', 'RIGHT\n', 'PRINT ', input()
if 2 * k > n: k, a, b, t = n - k + 1, b, a, t[:: -1]
print(a * (k - 1) + c + ('\n' + b + c).join(t))#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string slogan;
cin >> slogan;
if (k - 1 <= n - k) {
for (int i = 0; i < k - 1; i++) {
cout << "LEFT" << endl;
}
for (int i = 0; i < n - 1; i++) {
cout << "PRINT " << slogan[i] << endl;
cout << "RIGHT" << endl;
}
cout << "PRINT " << slogan[n - 1] << endl;
} else {
for (int i = 0; i < n - k; i++) {
cout << "RIGHT" << endl;
}
for (int i = n - 1; i > 0; i--) {
cout << "PRINT " << slogan[i] << endl;
cout << "LEFT" << endl;
}
cout << "PRINT " << slogan[0] << endl;
}
return 0;
}/*1690241573.9866326*/39. Combination Sum | 378. Kth Smallest Element in a Sorted Matrix |
162. Find Peak Element | 1529A - Eshag Loves Big Arrays |
19. Remove Nth Node From End of List | 925. Long Pressed Name |
1051. Height Checker | 695. Max Area of Island |
402. Remove K Digits | 97. Interleaving String |
543. Diameter of Binary Tree | 124. Binary Tree Maximum Path Sum |
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 501A - Contest |
160A- Twins | 752. Open the Lock |
1535A - Fair Playoff | 1538F - Interesting Function |
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |